Computability and Representations of the Zero Set
نویسنده
چکیده
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representation. The computation of the zero set is based on topological index theory, the most powerful tool for finding robust solutions of equations.
منابع مشابه
Irreducibility of the tensor product of Albeverio's representations of the Braid groups $B_3$ and $B_4$
We consider Albeverio's linear representations of the braid groups $B_3$ and $B_4$. We specialize the indeterminates used in defining these representations to non zero complex numbers. We then consider the tensor products of the representations of $B_3$ and the tensor products of those of $B_4$. We then determine necessary and sufficient conditions that guarantee the irreducibility of th...
متن کاملComplete Multi-Representations of Sets in a Computable Measure Space
In computable analysis, computability concepts depend critically on representations of computational objects. Different representations of a same set of objects can be compared under two kinds of reductions: continuous reductions ≤t and computable reductions ≤, which are string functions transform names under one naming system to names under another one. Most interesting are the complete (multi...
متن کاملEMG-based wrist gesture recognition using a convolutional neural network
Background: Deep learning has revolutionized artificial intelligence and has transformed many fields. It allows processing high-dimensional data (such as signals or images) without the need for feature engineering. The aim of this research is to develop a deep learning-based system to decode motor intent from electromyogram (EMG) signals. Methods: A myoelectric system based on convolutional ne...
متن کاملAdjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملپتانسیلهای محض SU(3) در مدل ورتکسهای مرکزی پهن
The potentials between static sources in various representations in SU(3) are calculated on the basis of the fat-centre-vortices model of Faber, Greensite and Olejník. At intermediate distances, potentials are in qualitative agreement with “Casimir scaling,” which says that the string tension is proportional to the quadratic operator of the representation. At large distances, screening occurs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 221 شماره
صفحات -
تاریخ انتشار 2008